منابع مشابه
The minimum barrier distance
In this paper we introduce a minimum barrier distance, MBD, defined for the (graphs of) real-valued bounded functions fA, whose domain D is a compact subsets of the Euclidean space R. The formulation of MBD is presented in the continuous setting, where D is a simply connected region in R, as well as in the case where D is a digital scene. The MBD is defined as the minimal value of the barrier s...
متن کاملA Practical Minimum Distance Method for Syntax Error Handling
Original citation: Dain, J. A. (1992) A practical minimum distance method for syntax error handling. Copyright and reuse: The Warwick Research Archive Portal (WRAP) makes this work by researchers of the University of Warwick available open access under the following conditions. Copyright © and all moral rights to the version of the paper presented here belong to the individual author(s) and/or ...
متن کاملQuantum Minimum Distance Classifier
We propose a quantum version of the well known minimum distance classification model called Nearest Mean Classifier (NMC). In this regard, we presented our first results in two previous works. First, a quantum counterpart of the NMC for two-dimensional problems was introduced, named Quantum Nearest Mean Classifier (QNMC), together with a possible generalization to any number of dimensions. Seco...
متن کاملMinimum Distance Error Correction
A method is presented for incorporating error correction using a minimum distance measure into LR parsers. The method is suitable for use by an automatic parser-generator. State information in the LR parser stack at the point of detection of error is used to generate a set of strings which are potential repairs to the input. A string with least minimum distance from the actual input is chosen a...
متن کاملMinimum Average Distance Triangulations
Some of the following problems look similar to the MAD Triangulation problem, but we have not found any deep connections: •Minimum Average Distance Spanning Subgraph in a budgeted version [2] was studied in the context of network design (minimizing average routing time). The problem is NP-complete even with unit weights. •Minimum Average Distance Spanning Tree [1]. NP-completeness is implied by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1957
ISSN: 0003-4851
DOI: 10.1214/aoms/1177707038